Rearrangement of DNA fragments: a branch-and-cut algorithm
نویسندگان
چکیده
In this paper we consider a problem that arises in the process of reconstruction of DNA fragments. We present a graph theoretical formulation of the problem and mention some extensions. We show this problem to be NP-hard. A 0-1 integer linear programming formulation of the problem is given and some preliminary results of a branch-and-cut algorithm based on this formulation are discussed. 1 We thank Professor Jo~ ao Meidanis (Unicamp) for bringing this problem to our attention. Abstract. In this paper we consider a problem that arises in the process of reconstruction of DNA fragments. We present a graph theoretical formulation of the problem and mention some extensions. We
منابع مشابه
A Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA
A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...
متن کاملDiversity Evaluation of Trigonella foenum-graecum Populations Using DNA Markers and Phytochemical Characteristics
Background: Fenugreek (Trigonella foenum-graecum L.) is an important medicinal plant that is a source of diosgenin, trigonelline and other valuable components. Fenugreek seeds is used for its pharmaceutical and nutraceutical properties. Objective: The aim of present study was to investigate the genetic diversity within and between different populations of Trigonella foenum-graecum using DNA ma...
متن کاملThe breakpoint distance for signed sequences
We consider the problem of estimating the rearrangement distance in terms of reversals, insertion and deletion between two genomes, G and H with possibly multiple genes from the same gene family. We define a notion of breakpoint distance for this problem, based on matching genes from the same family between G and H. We show that this distance is a good approximation of the edit distance, but NP...
متن کاملThe phenomenon of "vesting" in ring chromosomes and its role in the mutation theory and understanding of the mechanism of crossing-over.
After X-ray irradiation of Crepis capillaris dry seeds the authors detected, in addition to usual patterns of chromosome mutations, a new phenomenon of normal rod-shaped chromosomes being "vested," or encircled, by ring chromosomes. An analysis of the phenomena has demonstrated that the ring-chromosome production is connected with an X-ray-induced formation of a rigid loop by cross-links of dif...
متن کاملImage Encryption by Using Combination of DNA Sequence and Lattice Map
In recent years, the advancement of digital technology has led to an increase in data transmission on the Internet. Security of images is one of the biggest concern of many researchers. Therefore, numerous algorithms have been presented for image encryption. An efficient encryption algorithm should have high security and low search time along with high complexity.DNA encryption is one of the fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 116 شماره
صفحات -
تاریخ انتشار 2002